Configuration Spaces of Graphs with Certain Permitted Collisions
نویسندگان
چکیده
منابع مشابه
Characterizing graphs with convex and connected configuration spaces
We define and study exact, efficient representations of realization spaces Euclidean Distance Constraint Systems (EDCS). These are graphs with distance assignments on the edges (frameworks) or graphs with distance interval assignments on the edges. Each representation corresponds to a choice of non-edges or Cayley parameters. The set of realizable distance assignments to the chosen parameters y...
متن کاملZARISKI-LIKE SPACES OF CERTAIN MODULES
Let $R$ be a commutative ring with identity and $M$ be a unitary$R$-module. The primary-like spectrum $Spec_L(M)$ is thecollection of all primary-like submodules $Q$ such that $M/Q$ is aprimeful $R$-module. Here, $M$ is defined to be RSP if $rad(Q)$ isa prime submodule for all $Qin Spec_L(M)$. This class containsthe family of multiplication modules properly. The purpose of thispaper is to intro...
متن کاملConfiguration Spaces and Braid Groups on Graphs in Robotics
Configuration spaces of distinct labeled points on the plane are of practical relevance in designing safe control schemes for Automated Guided Vehicles (robots) in industrial settings. In this announcement, we consider the problem of the construction and classification of configuration spaces for graphs. Topological data associated to these spaces (e.g., dimension, braid groups) provide an effe...
متن کاملConfiguration spaces with summable labels
Let M be an n-manifold, and let A be a space with a partial sum behaving as an n-fold loop sum. We define the space C(M ;A) of configurations in M with summable labels in A via operad theory. Some examples are symmetric products, labelled configuration spaces, and spaces of rational curves. We show that C(In, ∂In;A) is an n-fold classifying space of C(In;A), and for n = 1 it is homeomorphic to ...
متن کاملKinematic Synthesis with Configuration Spaces*
This paper presents two algorithms for kinematic synthesis of mechanisms . A mechanism is specified by its input and output motions . The algorithms determine a three dimensional structure of rigid parts that implements the given specification . Both algorithms are based on a new composition operation on configuration spaces . Both algorithms are efficient, constraint-satisfaction schemes that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2018
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-018-0045-6